-
1 булев терм
-
2 булев терм
-
3 булев
-
4 булев
-
5 булев
-
6 булев
Русско-английский словарь по информационным технологиям > булев
-
7 внеинтегральный член
-
8 член
-
9 логический терм
-
10 подобные члены
1. similar terms2. like terms -
11 логический элемент
1) Engineering: Boolean term (структуры), gate circuit, logic component, logic device, logic element, logic gate, logic term (структуры)2) Mathematics: logical device3) Telecommunications: gating circuit4) Electronics: logical gate5) Information technology: gate, logic cell (в матрице элементов), logic unit, logical component, logical element, logical item, logical unit6) Astronautics: decision element7) Microelectronics: boolean gate, logic cell8) Makarov: logical term (структуры)9) Electrical engineering: binary-logic element, binary-logic gateУниверсальный русско-английский словарь > логический элемент
-
12 булев терм
1. Boolean termбазовый терм; элементарный терм — ground term
терм со знаком; член со знаком — signed term
свободный терм; свободный член — free term
2. logical term -
13 логический член
-
14 булев член
-
15 член
м. мат. term, memberстарший член — highest degree term; term of highest degree; leading coefficient
-
16 основной переключательный терм
Русско-английский большой базовый словарь > основной переключательный терм
-
17 перемещаемый терм
Русско-английский большой базовый словарь > перемещаемый терм
-
18 свободный терм
-
19 связанный терм
-
20 терм
1. term2. therm3. therms
См. также в других словарях:
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Term logic — In philosophy, term logic, also known as traditional logic, is a loose name for the way of doing logic that began with Aristotle, and that was dominant until the advent of modern predicate logic in the late nineteenth century.This entry is an… … Wikipedia
Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Boolean-valued model — In mathematical logic, a Boolean valued model is a generalization of the ordinary Tarskian notion of structure or model, in which the truth values of propositions are not limited to true and false , but take values in some fixed complete Boolean… … Wikipedia
Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… … Wikipedia
Boolean operators — For the mathematical function, click here: Boolean function Boolean Operators are words or marks typed in some search engines search box to show specific webpages with certain phrases or words together or omitted. The term is derived from Boolean … Wikipedia